A forest building process on simple graphs
نویسندگان
چکیده
منابع مشابه
A forest building process on simple graphs
Consider the following process for a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning forest of the graph. The probability of obtaining k components in this process for complete bipartite graphs is determined as well as a formula for the...
متن کاملMulti-phase Process Mining: Building Instance Graphs
Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model from event-based data. Existing techniques try to generate a complete process model from the data acquired. However, unless this model is the ultimate goal of mining, such a model is not always required. Instead, a good visual...
متن کاملthe impact of portfolio assessment on iranian efl students essay writing: a process-oriented approach
this study was conducted to investigate the impact of portfolio assessment as a process-oriented assessment mechanism on iranian efl students’ english writing and its subskills of focus, elaboration, organization, conventions, and vocabulary. out of ninety juniors majoring in english literature and translation at the university of isfahan, sixty one of them who were at the same level of writing...
15 صفحه اولOn Equational Simple Graphs
We consider simple graphs that can be obtained from the innnite complete binary tree B by some simple language-theoretic operations. Their decision problems for sentences in monadic second-order logic are reduced to those of B in a straightforward manner and therefore are solvable by the famous result of Rabin. Our goal is to provide a natural alternative characterization for these graphs. They...
متن کاملSimple dynamics on graphs
Does the interaction graph of a finite dynamical system can force this system to have a “complex” dynamics ? In other words, given a finite interval of integers A, which are the signed digraphsG such that every finite dynamical system f : An → An with G as interaction graph has a “complex” dynamics ? If |A| ≥ 3 we prove that no such signed digraph exists. More precisely, we prove that for every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.09.017